Delay Bounds in Communication Networks With Heavy-Tailed and Self-Similar Traffic
نویسندگان
چکیده
منابع مشابه
Heavy-Tailed ON/OFF Source Behavior and Self-Similar Traffic
Recent traffic measurement studies suggest that the self-similarity observed in packet traffic arises from aggregating individual sources which behave in an ON/OFF manner with heavy-tailed sojourn times in one or both of the states. In this paper, we investigate the connection between general ON/OFF behavior, self-similarity and queueing performance. We use chaotic maps to model general ON/OFF ...
متن کاملthe relationship of wtc with communication apprehension and self-perceived communication competene in english and persian context
بیشتر تحقیقات پیشین در زمینه تمایل به برقراری ارتباط به رابطه آن با عوامل فردی چون سن، جنس، نوع شخصیت و... صورت گرفته است. در صورتی که مطالعات کمتری به بررسی رابطه تمایل به برقراری ارتباط زبان آموزان فارسی زبان با ترس از برقراری ارتباط و توانش خود ادراکانه آنها در برقراری ارتباط در محیط فارسی و انگلیسی انجام شده است. بر اساس نظریه الیس (2008) تمایل به برقراری ارتباط جایگاه مهمی در زمینه آموزش م...
15 صفحه اولThe Delay of Open Markovian Queueing Networks: Uniform Functional Bounds, Heavy Traffic Pole Multiplicities, and Stability
For open Markovian queueing networks, we study the functional dependence of the mean number in the system (and thus also the mean delay since it is proportional to it by Little's Theorem) on the arrival rate or load factor. We obtain linear programs (LPs) which provide bounds on the pole multiplicity M of the mean number in the system, and automatically obtain lower and upper bounds on the coe ...
متن کاملGeneralised Processor Sharing Networks Fed by Heavy-tailed Traffic Flows
We consider networks where traffic is served according to the Generalised Processor Sharing (GPS) principle. GPS-based scheduling algorithms are considered important for providing differentiated quality of service in integrated-services networks. We are interested in the workload of a particular flow i at the bottleneck node on its path. Flow i is assumed to have long-tailed traffic characteris...
متن کاملSelf-similar Communication Models and Very Heavy Tails
Several studies of le sizes either being downloaded or stored in the world wide web have commented that tails can be so heavy that not only are variances innnite, but so are means. Motivated by this fact, we study the innnite node Poisson model under the assumption that transmission times are heavy tailed with innnite mean. The model is unstable but we are able to provide growth rates. Self-sim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2012
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2173713